Search results for "Homomorphic secret sharing"
showing 3 items of 3 documents
Properties and constraints of cheating-immune secret sharing schemes
2006
AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…
A distributed data storage and retrieval scheme in unattended WSNs using Homomorphic Encryption and secret sharing
2009
Many data storage schemes have been proposed in the past for keeping dependable data storage, but they are not designed for Unattended Wireless Sensor Networks (UWSNs). When applying these schemes to UWSNs, most of them have limitations such as high storage requirement, transmission cost, and not resilient to a large number of node compromises. To address the problem of data storage, transmission cost, and resilience of node compromise in UWSNs, we propose a novel Homomorphic Encryption and Homomorphic Secret Sharing based scheme (HEHSS) to accomplish the goals of confidentiality, resilience to node compromises, reliability, and efficiency of storage and transmission. Our scheme exploits th…
H2S: A Secure and Efficient Data Aggregative Retrieval Scheme in Unattended Wireless Sensor Networks
2009
In unattended wireless sensor networks, data are stored locally and retrieved on demand. To efficiently transmit the collector’s retrieval results, data are aggregated along being forwarded. The data confidentiality and integrity should be protected at the intermediate nodes. End-to-end encryption or hop-by-hop encryption based schemes are not efficient. Straightforward homomorphic encryption based scheme is not compromise resilient. To achieve all the desires, we propose a scheme - H2S by making use of both homomorphic secret sharing and homomorphic encryption. The security and efficiency of our scheme are justified by extensive analysis.